Bee Colony Optimization Solution to Single Machine Just in Time Scheduling Problem
نویسندگان
چکیده
منابع مشابه
Bi-objective Optimization for Just in Time Scheduling: Application to the Two-Stage Assembly Flow Shop Problem
This paper considers a two-stage assembly flow shop problem (TAFSP) where m machines are in the first stage and an assembly machine is in the second stage. The objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. JIT seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...
متن کاملThe one-machine just-in-time scheduling problem with preemption
This paper investigates thenotion of preemption in scheduling,with earliness and tardiness penalties. Starting from the observation that the classical cost model where penalties only depend on completion times does not capture the just-in-time philosophy, we introduce a new model where the earliness costs depend on the start times of the jobs. To solve this problem, we propose an efficient repr...
متن کاملThe Preemptive Just-in-time Scheduling Problem in a Flow Shop Scheduling System
Flow shop scheduling problem has a wide application in the manufacturing and has attracted much attention in academic fields. From other point, on time delivery of products and services is a major necessity of companies’ todays; early and tardy delivery times will result additional cost such as holding or penalty costs. In this paper, just-in-time (JIT) flow shop scheduling problem with preemp...
متن کاملUsing Bee Colony Optimization to Solve the Task Scheduling Problem in Homogenous Systems
Bee colony optimization (BCO) is one of the most recent algorithms in swarm intelligence that can be used in optimization problems this algorithm is based on the intelligent behavior of honey bees in foraging process. In this paper bee colony optimization is applied to solve the task scheduling problem which tasks have dependency with each other. Scheduling of tasks that represents by directed ...
متن کاملA New Ant Colony Optimization Approach for the Single Machine Total Weighted Tardiness Scheduling Problem
In this paper the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent setup times is faced with a new Ant Colony Optimization (ACO) approach. The proposed ACO algorithm is based on a new global pheromone update mechanism, which makes the pheromone trails asymptotically range between two bounds arbitrarily fixed and the ACO learning mechanism ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Future Computer and Communication
سال: 2014
ISSN: 2010-3751
DOI: 10.7763/ijfcc.2014.v3.336